Multiple-source single-sink maximum flow in directed planar graphs in $O(n^{1.5} \log n)$ time
نویسندگان
چکیده
We give an O(n logn) algorithm that, given a directed planar graph with arc capacities, a set of source nodes and a single sink node, finds a maximum flow from the sources to the sink . This is the first subquadratictime strongly polynomial algorithm for the problem.
منابع مشابه
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in $O(n^{1.5} \log n)$ Time
We give an O(n log n) algorithm that, given a directed planar graph with arc capacities, a set of source nodes and a set of sink nodes, finds a maximum flow from the sources to the sinks.
متن کاملMultiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time
We develop a new technique for computing maximum flow in directed planar graphs with multiple sources and a single sink that significantly deviates from previously known techniques for flow problems. This gives rise to an O(diameter · n logn) algorithm for the problem.
متن کاملMultiple-source single-sink maximum flow in directed planar graphs in O(n log n) time
We give an O(n logn) algorithm that, given a directed planar graph with arc capacities, a set of source nodes and a single sink node, finds a maximum flow from the sources to the sink . This is the first subquadratictime strongly polynomial algorithm for the problem.
متن کاملMultiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in O(n log n) Time
We give an O(n logn) algorithm that, given a directed planar graph with arc capacities, a set of source nodes and a set of sink nodes, finds a maximum flow from the sources to the sinks.
متن کاملMultiple-source multiple-sink maximum flow in planar graphs
In this paper we show an O(n log n) time algorithm for finding a maximum flow in a planar graph with multiple sources and multiple sinks. This is the fastest algorithm whose running time depends only on the number of vertices in the graph. For general (nonplanar) graphs the multiple-source multiple-sink version of the maximum flow problem is as difficult as the standard single-source single-sin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1008.5332 شماره
صفحات -
تاریخ انتشار 2010